An extension of the Moran process using type-specific connection graphs

The Moran process, as studied by Lieberman, Hauert and Nowak (2005) [1] , is a birth-death process that models the spread of mutations in two-type populations (residents-mutants) whose structure defined digraph. process' central notion probability randomly placed mutant will occupy whole vertex set (fixation probability). We extend this model considering type-specific graphs, consequently present results on fundamental problems related to fixation its computation. Finally, we view resident-mutant competing forces players choose digraphs indicate mutant's complete graph dominant strategy.